Adiabatic quantum search algorithm for structured problems

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Adiabatic quantum search algorithm for structured problems

The study of quantum computation has been motivated by the hope of finding efficient quantum algorithms for solving classically hard problems. In this context, quantum algorithms by local adiabatic evolution have been shown to solve an unstructured search problem with a quadratic speedup over a classical search, just as Grover’s algorithm. In this paper, we study how the structure of the search...

متن کامل

Adiabatic quantum algorithm for search engine ranking.

We propose an adiabatic quantum algorithm for generating a quantum pure state encoding of the PageRank vector, the most widely used tool in ranking the relative importance of internet pages. We present extensive numerical simulations which provide evidence that this algorithm can prepare the quantum PageRank state in a time which, on average, scales polylogarithmically in the number of web page...

متن کامل

Quantum Search on Structured Problems

This paper shows how a basic property of unitary transformations can be used for meaningful computations. This approach immediately leads to search-type applications, where it improves the number of steps by a square-root-a simple minded search that takes steps, can be improved to approximately steps. The quantum search algorithm is one of several immediate consequences of this framework. Sever...

متن کامل

Quantum Algorithms for Highly Structured Search Problems

We consider the problem of identifying a base k string given an oracle which returns information about the number of correct components in a query, specifically, the Hamming distance between the query and the solution, modulo r = max{2, 6 − k}. Classically this problem requires Ω(n logr k) queries. For k ∈ {2, 3, 4} we construct quantum algorithms requiring only a single quantum query. For k > ...

متن کامل

Nested quantum search and structured problems

Nicolas J. Cerf, Lov K. Grover, and Colin P. Williams W. K. Kellogg Radiation Laboratory, California Institute of Technology, Pasadena, California 91125 Information and Computing Technologies Research Section, Jet Propulsion Laboratory, California Institute of Technology, Pasadena, California 91109 Ecole Polytechnique, Code Postale 165, Université Libre de Bruxelles, 1050 Brussels, Belgium 3C-4...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physical Review A

سال: 2003

ISSN: 1050-2947,1094-1622

DOI: 10.1103/physreva.68.062312